例句與造句

1. Recursively enumerable languages are not closed under set difference or complementation.
2. It may be shown that unrestricted grammars characterize the recursively enumerable languages.
3. Let L be a recursively enumerable language.
4. Recursively enumerable languages are intersection, but not under set difference; see Recursively enumerable language # Closure properties.
5. Recursively enumerable languages are intersection, but not under set difference; see Recursively enumerable language # Closure properties.
6. It's difficult to find recursively enumerable language in a sentence. 用recursively enumerable language造句挺難的
7. A universal Turing machine can calculate any recursive function, decide any recursive language, and accept any recursively enumerable language.
8. A language which is accepted by such a Turing machine is called a "'recursively enumerable language " '.
9. Recursively enumerable languages are known as "'type-0 "'languages in the Chomsky hierarchy of formal languages.
10. Within the Chomsky hierarchy, the regular languages, the context-free languages, and the recursively enumerable languages are all full AFLs.
11. Such sets are recursively enumerable languages and every recursively enumerable language is the restriction of some such set to a sub-alphabet of "'A " '.
12. Such sets are recursively enumerable languages and every recursively enumerable language is the restriction of some such set to a sub-alphabet of "'A " '.
13. Within the Chomsky hierarchy, the regular languages, the context-free languages, and the recursively enumerable languages are all cones, whereas the context-sensitive languages and the recursive languages are only faithful cones.
14. These are all proper inclusions, meaning that there exist recursively enumerable languages that are not context-sensitive, context-sensitive languages that are not context-free and context-free languages that are not regular.